Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems

نویسنده

  • Madhavan Mukund
چکیده

Hereditary history preserving bisimulation is a natural extension of bisimulation to the setting of so-called “true” concurrency. Somewhat surprisingly, this extension turns out to be undecidable, in general, for finite-state concurrent systems. In this paper, we show that for a substantial and useful class of finite-state concurrent systems— those whose semantics can be described in terms of Mazurkiewicz traces— hereditary history preserving is decidable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Plain and Hereditary History-Preserving Bisimulation

We investigate the difference between two well-known notions of independence bisimilarity, history-preserving bisimulation and hereditary history-preserving bisimulation. We characterise the difference between the two bisimulations in trace-theoretical terms, advocating the view that the first is (just) a bisimulation for causality, while the second is a bisimulation for concurrency. We explore...

متن کامل

The decidability border of hereditary history preserving bisimilarity

In 2000 Jurdziński and Nielsen proved that hereditary history preserving bisimilarity (hhp-b) is undecidable for finite systems [7,8], and thereby resolved a long-standing open problem. The negative outcome contrasts the weaker history preserving bisimilarity (hp-b), for which decidability is well-established [15,6]. A definition of (h)hp-b on labelled 1-safe Petri nets (net systems) follows.

متن کامل

Propositional Temporal Logics and Equivalences

We compare propositional temporal logics by comparing the equivalences that they induce on models. Linear time, branching time and partial order temporal logics are considered. The logics are interpreted on occurrence transition systems, generated by labelled prime event structures without auto-concurrency. The induced equivalences are also compared to directly deened equivalences, e.g., histor...

متن کامل

Laboratory for Foundations of Computer Science Hereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems

History preserving (hp) and hereditary hp (hhp) bisimilarity are two equivalences for concurrent systems that reflect causal dependencies between events. hp bisimilarity is well-known to be decidable for finite-state systems, whereas the decidability of hhp bisimilarity had been a renowned open problem for several years until it was finally proved undecidable. Recently, the following positive r...

متن کامل

Hereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems

History preserving (hp) and hereditary hp (hhp) bisimilarity are two equivalences for concurrent systems that reflect causal dependencies between events. hp bisimilarity is well-known to be decidable for finite-state systems, whereas the decidability of hhp bisimilarity had been a renowned open problem for several years until it was finally proved undecidable. Recently, the following positive r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002